Towards Verifying Cooperatively-Scheduled Runtimes using CSP

In this paper we present the novel verification of synchronous channel communication and alternation (choice) by considering environment within which our primitives are executing. Our work is in exploring development a multi-threaded scheduler for cooperatively scheduled process-oriented language, ProcessJ. We use CSP to produce formal specifications implementation various parts language runtime (scheduler, components, generated code). established that model choice as well tool FDR formally prove implementations correct behave expected, when executed (the execution environment). approach not seen similar research, because consider behaviour systems examine under restrictions imposed an (e.g., system, scheduler, operating etc.) show even with such work. More specifically, correctness system ProcessJ cooperative scheduler. The main contributions models defined method undertaken verify choice.